Steady state solution and convergence rate of time-dependent Markov chains of queuing networks
نویسندگان
چکیده
منابع مشابه
A Multi-Level Method for the Steady State Solution of Discrete-Time Markov Chains
Markov chains are one of the most important kinds of models in Simulation. A fast iterative algorithm for the steady state solution of continuous-time Markov chains (CTMCs) was introduced by Horton and Leutenegger [HL94]. The so-called multi-level algorithm utilizes ideas from algebraic multigrid to provide an efficient alternative to the currently used Gauss-Seidel and successive overrelaxatio...
متن کاملA computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment
Many-server queuing networks with general service and abandonment times have proven to be a realistic model for scenarios such as call centers and health-care systems. The presence of abandonment makes analytical treatment difficult for general topologies. Hence, such networks are usually studied by means of fluid limits. The current state of the art, however, suffers from two drawbacks. First,...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملA Multi-Level Method for the Steady State Solution of Markov Chains
This paper illustrates the current state of development of an algorithm for the steady state solution of continuous-time Markov chains. The so-called multi-level algorithm utilizes ideas from algebraic multigrid to provide an efficient alternative to the currently used Gauss-Seidel and successive overrelaxation methods. The multi-level method has been improved through several iterations, so tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1988
ISSN: 0898-1221
DOI: 10.1016/0898-1221(88)90156-3